Projections of Vector Addition System Reachability Sets are Semilinear
نویسندگان
چکیده
The reachability sets of Vector Addition Systems of dimension six or more can be non-semilinear. This may be one reason why the inclusion problem (as well as the equality problem) for reachability sets of vector addition systems in general is undecidable, even though the reachability problem itself is known to be decidable. We show that any one-dimensional projection of the reachability set of an arbitrary vector addition system is semilinear, and hence “simple”. This work was supported in part by a grant from AT&T, ONR contract N0001485-C-0731, and NSF grant DCR-8351757.
منابع مشابه
Semilinearity of Vector Addition Systems with States
The decidability of the reachability problem for VASS has been open for a long time, and today the computational complexity of the problem is still open. Obviously, there is more hope of obtaining elementary complexity upper bounds by restricting the class of VASS, for example by considering those for which the reachability sets are effectively semilinear. Presburger arithmetic would then provi...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملOn P Systems Operating in Sequential Mode
In the standard definition of a P system, a computation step consists of a parallel application of a “maximal” set of nondeterministically chosen rules. Referring to this system as a parallel P system, we consider in this paper a sequential P system, in which each step consists of an application of a single nondeterministically chosen rule. We show the following: 1. For 1-membrane catalytic sys...
متن کاملThe General Vector Addition System Reachability Problem by Presburger Inductive Invariants
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known to be decidable by algorithms exclusively based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition. This decomposition is used in this paper to prove that the Parikh images of languages recognized by VASs are semi-pseudo-linear ; a class that extends th...
متن کاملOn Computing Reachability Sets of Process Rewrite Systems
We consider the problem of symbolic reachability analysis of a class of term rewrite systems called Process Rewrite Systems (PRS). A PRS can be seen as the union of two mutually interdependent sets of term rewrite rules: a prefix rewrite system (or, equivalently, a pushdown system), and a multiset rewrite system (or, equivalently, a Petri net). These systems are natural models for multithreaded...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 64 شماره
صفحات -
تاریخ انتشار 1989